Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
fib(0) → 0
fib(s(0)) → s(0)
fib(s(s(x))) → +(fib(s(x)), fib(x))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
fib(0) → 0
fib(s(0)) → s(0)
fib(s(s(x))) → +(fib(s(x)), fib(x))
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Quasi-Precedence:
[s1, +2] > fib1
Status: +2: [2,1]
s1: [1]
0: multiset
fib1: multiset